Almost Completely Decomposable Torsion-free Groups

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computable Completely Decomposable Groups

A completely decomposable group is an abelian group of the form ⊕ i Hi, where Hi ≤ (Q,+). We show that every computable completely decomposable group is ∆5-categorical. We construct a computable completely decomposable group which is not ∆4-categorical, and give an example of a computable completely decomposable group G which is ∆4-categorical but not ∆3-categorical. We also prove that the inde...

متن کامل

Gaussian Groups Are Torsion Free

Assume that G is a group of fractions of a cancellative monoid where lower common multiples exist and divisibility has no infinite descending chain. Then G is torsion free. The result applies in particular to all finite Coxeter type Artin groups. Finding an elementary proof for the fact that Artin’s braid groups are torsion free has been reported to be a longstanding open question [9]. The exis...

متن کامل

Torsion in Profinite Completions of Torsion-free Groups

LET G be a residually-finite torsion-free group. Is Gthe profinite completion of G-torsion free? This question was asked in [CKL] where it was shown that if G is a finitely generated metabelian-by-finite group then indeed G is torsion free. On the other hand Evans [E] showed that if G is not finitely generated then it is possible that G has torsion. His example is also metabelian. In this note ...

متن کامل

The adjunction problem over torsion-free groups.

We prove injectivity and relative asphericity for "layered" systems of equations over torsion-free groups, when the exponent matrix is invertible over Z.

متن کامل

On Endomorphisms of torsion-Free hyperbolic Groups

Let H be a torsion-free δ-hyperbolic group with respect to a finite generating set S. Let g1, . . . , gn and g1∗, . . . , gn∗ be elements of H such that gr∗ is conjugate to gr for each r = 1, . . . , n. There is a uniform conjugator if and only if W (g1∗, . . . , gn∗) is conjugate to W (g1, . . . , gn) for every word W in n variables and length up to a computable constant depending only on δ, ♯...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Rocky Mountain Journal of Mathematics

سال: 1992

ISSN: 0035-7596

DOI: 10.1216/rmjm/1181072751